Sequence Alignment Algorithms for Run-Length-Encoded Strings
نویسندگان
چکیده
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn′,m′n}) time and O(max{m,n}) space, for two strings of lengths m and n, with m′ and n′ runs, respectively. We assume the linear-gap model and make no assumption on the scoring matrices, which maximizes the applicability of these algorithms. The trace (i.e., the way to align two strings) of an optimal solution can also be recovered within the same time and space bounds.
منابع مشابه
String comparison by transposition networks
Computing string or sequence alignments is a classical method of comparing strings and has applications in many areas of computing, such as signal processing and bioinformatics. Semi-local string alignment is a recent generalisation of this method, in which the alignment of a given string and all substrings of another string are computed simultaneously at no additional asymptotic cost. In this ...
متن کاملCompressed and Searchable Indexes for Highly Similar Strings (Invited Talk)
The collection indexing problem is defined as follows: Given a collection of highly similar strings, build a compressed index for the collection of strings, and when a pattern is given, find all occurrences of the pattern in the given strings. Since the index is compressed, we also need a separate operation which retrieves a specified substring of one of the given strings. Such a collection of ...
متن کاملAn Application of the ABS LX Algorithm to Multiple Sequence Alignment
We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...
متن کاملMatching for Run-Length Encoded Strings
1 Motivation Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of nding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y i...
متن کاملLocal Sequence Alignment Against a Database Problem
Local Sequence Algignment. The local sequence alignment problem is defined as follows: Given two strings S = s 1. .. s n and T = t 1. .. t m , a substitution matrix Score and an insertion/deletion penalty δ, find a pair of substrings s i. .. s i+k of S and t j. .. t j+l of T that have the best overall alignment score, and return the best alignment for them. Local Sequence Algignment against a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008